Evolutionary Neural Networks algorithm for the Dynamic Frequency Assignment Problem
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولThe dynamic frequency assignment problem
In this paper, we consider a frequency assignment problem occurring in a military context. The main originality of the problem pertains to its dynamic dimension: new communications requiring frequency assignments need to be established throughout a deployment. The problem decomposes in three phases: assignment of an initial kernel of communications, dynamic assignment of new communication links...
متن کاملSolving the Dynamic Frequency Assignment Problem
Wireless communication is used in many different situations such as mobile telephony, radio and TV broadcasting, satellite communication, and military operations. For all these situations, a frequency assignment problem arises with application of specific characteristics. Different modelling ideas for every problem features, have been developed such as the handling of interference among radio s...
متن کاملFixed Channel Assignment and Neural Network Algorithm for Channel Assignment Problem in Cellular Radio Networks
The channel-assignment problem is important in mobile telephone communication. Since the usable range of the frequency spectrum is limited, the optimal channel-assignment problem has become increasingly important. The goal of this problem is to find a channel assignment to requested calls with the minimum number of channels subject to interference constraints between channels. This algorithm co...
متن کاملA Simple Randomized Algorithm for the Xed Frequency Assignment Problem
In this paper, we deal with the xed frequency assignment problem, using for this purpose the classical theoretical cellular model. We give a simple randomized algorithm, based on the construction of a solution using a \dynamic" tree. Then, performances of this algorithm are evaluated with those obtained by well-known heuristics in terms of quality solutions and computation time.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Science and Information Technology
سال: 2011
ISSN: 0975-4660
DOI: 10.5121/ijcsit.2011.3304